On Eliminating Redundant Computation from High-Level Array Statements

High-level array programming languages are well-suited for scientific computing. Such languages free the programmer from the responsibility of managing burdensome low-level details that complicate programming in languages like C and Fortran. But these details do not vanish. We argue that the compiler should relieve the programmer of this burden. In this paper, we present a compiler optimization called partial array redundancy elimination that removes redundant computation from certain high-level array statements resulting in cleaner, more portable and more concise code without any performance loss. This optimization is critical to certain codes and achieves a speedup of 36% on the NAS MG parallel benchmark.